Functional Dependencies in Presence of Errors
نویسندگان
چکیده
A relational database D is given with Ω as the set of attributes. The rows (tuples, data of one individual) are transmitted through a noisy channel. It is supposed that at most one data in a row can be changed by the transmission. We say that A → b (A ⊂ Ω, b ∈ Ω) is an error-correcting functional dependency if the data in A uniquely determine the data in b in spite of the error. We investigate the problem how much larger a minimal error-correcting functional dependency can be than the original one.
منابع مشابه
Erratum to "Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets"
This note corrects two errors that occurred during the typesetting of our paper “Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets”, which appeared in Hartmann et al. [Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets, Theoret. Comput. Sci. 353(2) (2006) 167–196]. © 2006 Elsevier B.V. All rights reserved.
متن کاملAn experimental study on the determination of gantry angle and SSD dependencies of TLD and MOSFET dosimeter systems
Background: The purpose of this study was to investigate the various gantry angle and SSD dependencies of TLD and MOSFET dosimeters. Materials and Methods: LiF (Mg) TLD and MOSFET were used in this study. Dosimeter systems were calibrated and then irradiated at various gantry angle and SSD by applying 6 MV photon energy. Results: Based on the results, MOSFET changes were found to be in 2% range...
متن کاملHybrid steepest-descent method with sequential and functional errors in Banach space
Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...
متن کاملAnswering Queries Using Views in the Presence of Functional Dependencies
This paper is concerned with the problem of answering queries using views in the presence of functional dependencies. Previous algorithms for answering queries using views, such as the MiniCon algorithm, have not taken into account the presence of functional dependencies. As a consequence, these algorithms may miss query rewritings in the presence of such dependencies. In this paper, we present...
متن کاملData Cleaning and Semantic Improvement in Biological Databases
Public genomic and proteomic databases can be affected by a variety of errors. These errors may involve either the description or the meaning of data (namely, syntactic or semantic errors). We focus our analysis on the detection of semantic errors, in order to verify the accuracy of the stored information. In particular, we address the issue of data constraints and functional dependencies among...
متن کاملScalable Query Reformulation Using Views in the Presence of Functional Dependencies
The problem of answering queries using views in data integration has recently received considerable attention. A number of algorithms, such as the bucket algorithm, the SVB algorithm, the MiniCon algorithm, and the inverse rules algorithm, have been proposed. However, integrity constraints, such as functional dependencies, have not been considered in these algorithms. Some efforts have been mad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002